Spectral analysis of cell-graphs of cancer

نویسندگان

  • Cigdem Demir
  • S. Humayun Gultekin
  • Bülent Yener
چکیده

In this paper, we investigate the properties of the cell-graphs by using the spectral graph theory. The spectral analysis is performed on (i) the adjacency matrix of a cell-graph, and (ii) the normalized Laplacian of the cell-graph. We show that the spectra of the cell-graphs of cancerous tissues are unique and the features extracted from these spectra distinguish the cancerous (malignant glioma) tissues from the healthy and benign reactive/inflammatory processes. Our experiments on 646 brain biopsy samples of 60 different patients demonstrate that by using spectral features defined on the normalized Laplacian of the graph, we achieve 100% accuracy in the classification of cancerous and healthy tissues. In the classification of cancerous and benign tissues, our experiments yield 92% and 89% accuracy on the testing set for the cancerous and benign tissues. We also analyze graph spectra to identify the distinctive spectral features of the cancerous tissues to conclude that (i) the features representing the cellular density are the most distinctive features to distinguish the cancerous and healthy tissues, (ii) and the number of the eigenvalues in the normalized Laplacian spectrum that have a value of 0 is the most distinctive feature to distinguish the cancerous and benign tissues. ∗ Present address: Oregon Health and Science University, Department of Pathology, Portland, OR. Technical report, Rensselaer Polytechnic Institute, Department of Computer Science, TR-04-17.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

SIGNLESS LAPLACIAN SPECTRAL MOMENTS OF GRAPHS AND ORDERING SOME GRAPHS WITH RESPECT TO THEM

Let $G = (V, E)$ be a simple graph. Denote by $D(G)$ the diagonal matrix $diag(d_1,cdots,d_n)$, where $d_i$ is the degree of vertex $i$  and  $A(G)$ the adjacency matrix of $G$. The  signless Laplacianmatrix of $G$ is $Q(G) = D(G) + A(G)$ and the $k-$th signless Laplacian spectral moment of  graph $G$ is defined as $T_k(G)=sum_{i=1}^{n}q_i^{k}$, $kgeqslant 0$, where $q_1$,$q_2$, $cdots$, $q_n$ ...

متن کامل

Patterns Prediction of Chemotherapy Sensitivity in Cancer Cell lines Using FTIR Spectrum, Neural Network and Principal Components Analysis

    Drug resistance enables cancer cells to break away from cytotoxic effect of anticancer drugs. Identification of resistant phenotype is very important because it can lead to effective treatment plan. There is an interest in developing classifying models of resistance phenotype based on the multivariate data. We have investigated a vibrational spectroscopic approach in order to characterize a...

متن کامل

Patterns Prediction of Chemotherapy Sensitivity in Cancer Cell lines Using FTIR Spectrum, Neural Network and Principal Components Analysis

    Drug resistance enables cancer cells to break away from cytotoxic effect of anticancer drugs. Identification of resistant phenotype is very important because it can lead to effective treatment plan. There is an interest in developing classifying models of resistance phenotype based on the multivariate data. We have investigated a vibrational spectroscopic approach in order to characterize a...

متن کامل

Spectral analysis of cell-graphs for automated cancer diagnosis

The cell-graph approach captures the information encoded in tissue samples by capturing the spatial distribution of cells and their cluster formations. In a cellgraph, nodes and edges represent the cell clusters and pairwise relationships between them, respectively. It is shown in [1] that the features of cell-graphs of cancerous tissues are significantly different from those of healthy tissues...

متن کامل

THE SPECTRAL DETERMINATION OF THE MULTICONE GRAPHS Kw ▽ C WITH RESPECT TO THEIR SIGNLESS LAPLACIAN SPECTRA

The main aim of this study is to characterize new classes of multicone graphs which are determined by their signless Laplacian spectra. A multicone graph is defined to be the join of a clique and a regular graph. Let C and K w denote the Clebsch graph and a complete graph on w vertices, respectively. In this paper, we show that the multicone graphs K w ▽C are determined by their signless ...

متن کامل

Entropy Generation of Variable Viscosity and Thermal Radiation on Magneto Nanofluid Flow with Dusty Fluid

The present work illustrates the variable viscosity of dust nanofluid runs over a permeable stretched sheet with thermal radiation. The problem has been modelled mathematically introducing the mixed convective condition and magnetic effect. Additionally analysis of entropy generation and Bejan number provides the fine points of the flow. The of model equations are transformed into non-linear or...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004